Moving targets and experiments: One publisher's mobile journey
نویسندگان
چکیده
منابع مشابه
Moving targets and experiments: One publisher's mobile journey
For 80 years, Annual Reviews has been synthesizing the literature to help scientists keep up with the wealth of scientific research that is published each year. Our content has traditionally been delivered online and in print as long-form review articles, but with scientists more pressured than ever, we have looked into mobile platforms for new ways to fit information into readers’ workflows. W...
متن کاملPROTECTING MOVING TARGETS WITH MULTIPLE MOBILE RESOURCES Protecting Moving Targets with Multiple Mobile Resources
In recent years, Stackelberg Security Games have been successfully applied to solve resource allocation and scheduling problems in several security domains. However, previous work has mostly assumed that the targets are stationary relative to the defender and the attacker, leading to discrete game models with finite numbers of pure strategies. This paper in contrast focuses on protecting mobile...
متن کاملProtecting Moving Targets with Multiple Mobile Resources
In recent years, Stackelberg Security Games have been successfully applied to solve resource allocation and scheduling problems in several security domains. However, previous work has mostly assumed that the targets are stationary relative to the defender and the attacker, leading to discrete game models with finite numbers of pure strategies. This paper in contrast focuses on protecting mobile...
متن کاملMoving Targets
In addition to its well-known role in regulating blood pressure and fluid balance, the renin-angiotensin-aldosterone system (RAAS) has continued to fascinate both researchers and clinicians because of the several additional functions that it has been proposed to carry out. Disruption of the production or action of angiotensin II (Ang II) during development, either by gene mutation or by pharmac...
متن کاملMixing Times and Moving Targets
We consider irreducible Markov chains on a finite state space. We show that the mixing time of any such chain is equivalent to the maximum, over initial states x and moving large sets (As)s, of the hitting time of (As)s starting from x. We prove that in the case of the d-dimensional torus the maximum hitting time of moving targets is equal to the maximum hitting time of stationary targets. Neve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Services & Use
سال: 2012
ISSN: 1875-8789,0167-5265
DOI: 10.3233/isu-2012-0635